Axiomatizing Flat Iteration
نویسنده
چکیده
Flat iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the rst argument to be a sum of atomic actions. It generalizes pre x iteration, in which the rst argument is a single action. Complete nite equational axiomatizations are given for ve notions of bisimulation congruence over basic CCS with at iteration, viz. strong congruence, branching congruence, -congruence, delay congruence and weak congruence. Such axiomatizations were already known for pre x iteration and are known not to exist for general iteration. The use of at iteration has two main advantages over pre x iteration:
منابع مشابه
Axiomatizing rational power series
Iteration semirings are Conway semirings satisfying Conway’s group identities. We show that the semirings Nrat〈〈Σ∗〉〉 of rational power series with coefficients in the semiring N of natural numbers are the free partial iteration semirings. Moreover, we characterize the semirings Nrat ∞ 〈〈Σ∗〉〉 as the free semirings in the variety of iteration semirings defined by three additional simple identitie...
متن کاملAxiomatizing Prefix Iteration with Silent Steps
Prefix iteration is a variation on the original binary version of the Kleene star operation P Q, obtained by restricting the first argument to be an atomic action. The interaction of prefix iteration with silent steps is studied in the setting of Milner’s basic CCS. Complete equational axiomatizations are given for four notions of behavioural congruence over basic CCS with prefix iteration, viz...
متن کاملAlgorithms for Batch Hierarchical Reinforcement Learning
Hierarchical Reinforcement Learning (HRL) exploits temporal abstraction to solve large Markov Decision Processes (MDP) and provide transferable subtask policies. In this paper, we introduce an off-policy HRL algorithm: Hierarchical Q-value Iteration (HQI). We show that it is possible to effectively learn recursive optimal policies for any valid hierarchical decomposition of the original MDP, gi...
متن کاملA Review of Fixed-Point Convergent Method for Resolving Non-Linear/Linear Field Difficulties
Fixed point iteration is a technique that is used in order to compute function for fixed points; fixed point can be given by many different theorems of fixed point iteration. Problems that occur in the field of nonlinear and linear address by the techniques of fixed point iteration. This paper tells about the fixed point iteration techniques and its applicability in different field of engineeri...
متن کامل